Multivision: An Intractable Impartial Game With a Linear Winning Strategy

نویسنده

  • Aviezri S. Fraenkel
چکیده

Multivision is played by two players who move alternately on a finite number of piles of finitely many tokens. A move consists of selecting a nonempty pile and changing the number of tokens in it. If the change is just any reduction in the number of tokens, we have the well-known game of Nim [1], [2]. In the present case, however, it is also permissible, normally, to increase the size of a pile by an arbitrarily large factor.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Developing Strategic and Mathematical Thinking via Game Play: Programming to Investigate a Risky Strategy for Quarto

The Maths Arcade is an extracurricular club for undergraduate students to play and analyse strategy board games, aimed at building a mathematical community of staff and students as well as improving strategic and mathematical thinking. This educational initiative, used at several universities in the U.K., will be described. Quarto is an impartial game played at the Maths Arcade, in that there i...

متن کامل

Winning strategies for aperiodic subtraction games

We provide a winning strategy for sums of games of Mark-t, an impartial game played on the nonnegative integers where each move consists of subtraction by an integer between 1 and t − 1 inclusive, or division by t, rounding down when necessary. Our algorithm computes the Sprague-Grundy values for arbitrary n in quadratic time. This addresses one of the directions of further study proposed by Av...

متن کامل

Algorithms for lattice games

This paper provides effective methods for the polyhedral formulation of impartial finite combinatorial games as lattice games [GMW09, GM09]. Given a rational strategy for a lattice game, a polynomial time algorithm is presented to decide (i) whether a given position is a winning position, and to find a move to a winning position, if not; and (ii) to decide whether two given positions are congru...

متن کامل

Aperiodic Subtraction Games

Periodicity is a fundamental property of many combinatorial games. It is sought vigorously, yet remains elusive in important cases, such as for some octal games, notably Grundy’s game. Periodicity is important, because it provides poly-time winning strategies for many games. In particular, subtraction games, impartial and partizan, have been proved to be periodic. Our main purpose here is to ex...

متن کامل

Games with additional winning strategies

In game theory, deciding whether a designed player wins a game corresponds to check whether he has a winning strategy. There are situations in which it is important to know whether some extra winning strategy also exists. In this paper we investigate this question over two-player finite games, under the reachability objective. We provide an automata-based technique that, given such a game, it a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998